A Sequential Linearization Approach for Solving Mixed-Discrete Nonlinear Design Optimization Problems

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Particle Swarm Optimization Algorithm for Mixed-Variable Nonlinear Problems

Many engineering design problems involve a combination of both continuous anddiscrete variables. However, the number of studies scarcely exceeds a few on mixed-variableproblems. In this research Particle Swarm Optimization (PSO) algorithm is employed to solve mixedvariablenonlinear problems. PSO is an efficient method of dealing with nonlinear and non-convexoptimization problems. In this paper,...

متن کامل

A dynamic programming approach for solving nonlinear knapsack problems

Nonlinear Knapsack Problems (NKP) are the alternative formulation for the multiple-choice knapsack problems. A powerful approach for solving NKP is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. Despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...

متن کامل

A Continuation Approach for Solving Nonlinear Optimization Problems with Discrete Variables

A new approach to solving nonlinear optimization problems with discrete variables using continuation methods is described. Our focus is on pure integer nonlinear optimization problems with linear equality constraints (ILENP) but we show how the technique can be extended to more general classes of problems such as those involving linear inequality and mixed integer constraints. We transform the ...

متن کامل

A feasible rounding approach for mixed-integer nonlinear optimization problems

We introduce a new technique to generate good feasible points of mixedinteger nonlinear optimization problems. It makes use of the so-called inner parallel set of the relaxed feasible set, which was employed in O. Stein, Error bounds for mixed integer linear optimization problems, Mathematical Programming, Vol. 156 (2016), 101–123, as well as O. Stein, Error bounds for mixed integer nonlinear o...

متن کامل

An Improved Approach For Solving Mixed-Integer Nonlinear Programming Problems

This special class of a nonlinear mathematical programming problem which is addressed in this paper has a structure characterized by a subset of variables restricted to assume discrete values, which are linear and separable from the continuous variables. The strategy of releasing nonbasic variables from their bounds, combined with the “active constraint” method and the notion of superbasics, ha...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mechanical Design

سال: 1991

ISSN: 1050-0472,1528-9001

DOI: 10.1115/1.2912786